Data analysis, computation and mathematics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomness, Computation and Mathematics

This article examines some of the recent advances in our understanding of algorithmic randomness. It also discusses connections with various areas of mathematics, computer science and other areas of science. Some questions and speculations will be discussed.

متن کامل

Mathematics of Computation

For each prime p, let p# be the product of the primes less than or equal to p. We have greatly extended the range for which the primality of n!± 1 and p#± 1 are known and have found two new primes of the first form (6380! + 1, 6917!− 1) and one of the second (42209# + 1). We supply heuristic estimates on the expected number of such primes and compare these estimates to the number actually found.

متن کامل

Data engineering - fuzzy mathematics in systems theory and data analysis

Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd data engineering fuzzy mathematics in systems theory and data analysis that can be a ...

متن کامل

Teaching and Doing Mathematics with Symbolic Computation

The impact of computers on teaching of mathematics is reviewed, to demonstrate a need to reorganise curriculum in mathematics to meet the needs of students of science and engineering in an era of abundant computers and sophisticated software for symbolic computation. Examples are presented of graphical enhancement of teaching of various mathematical concepts.

متن کامل

Limit Computable Mathematics and Interactive Computation

We are now investigating an "executable" fragment of classical mathematics for testing formal proofs to make formal proof developments less laborious. Several theories of execution of full classical proofs are known. In these theories, some kind of abstract values such as continuations, are necessary. It makes them illegible from computational point of view, although they are mathematically int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1972

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/99740